Admissibility of Kneading Sequences and Structure of Hubbard Trees for Quadratic Polynomials
نویسنده
چکیده
Hubbard trees are invariant trees connecting the points of the critical orbits of postcritically finite polynomials. Douady and Hubbard [DH1] introduced these trees and showed that they encode the essential information of Julia sets in a combinatorial way. The itinerary of the critical orbit within the Hubbard tree is encoded by a (pre)periodic sequence on {0, 1} called kneading sequence. We prove that the kneading sequence completely encodes the Hubbard tree and its dynamics, and we show how to reconstruct the tree and in particular its branch points (together with their periods, their relative posititions, their number of arms and their local dynamics) in terms of the kneading sequence alone. Every kneading sequence gives rise to an abstract Hubbard tree, but not every kneading sequence occurs in real dynamics or in complex dynamics. Milnor and Thurston [MT] classified which kneading sequences occur in real dynamics; we do the same for complex dynamics in terms of a complex admissibility condition. This complex admissibility condition fails if and only if the abstract Hubbard tree has a so-called evil periodic branch point that is incompatible with local homeomorphic dynamics on the plane.
منابع مشابه
Hyperbolicity is Dense in the Real Quadratic Family
It is shown that for non-hyperbolic real quadratic polynomials topological and qua-sisymmetric conjugacy classes are the same. By quasiconformal rigidity, each class has only one representative in the quadratic family, which proves that hyperbolic maps are dense. Statement of the results. Dense Hyperbolicity Theorem In the real quadratic family f a (x) = ax(1 − x) , 0 < a ≤ 4 the mapping f a ha...
متن کاملSubdivision rule constructions on critically preperiodic quadratic matings
‘Mating’ describes a collection of operations that combine two complex polynomials to obtain a new dynamical system on a quotient topological 2-sphere. The dynamics of the mating are then dependent on the two polynomials and the manner in which the quotient space was defined, which can be difficult to visualize. In this article, we use Hubbard trees and finite subdivision rules as tools to exam...
متن کاملIterated Monodromy Groups of Quadratic Polynomials, I
We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and explicit their connection to the ‘kneading sequence’ of the polynomial. We then give recursive presentations by generators and relations for these groups, and study some of their properties, like torsion and ‘branchness’.
متن کاملSome relations between Kekule structure and Morgan-Voyce polynomials
In this paper, Kekule structures of benzenoid chains are considered. It has been shown that the coefficients of a B_n (x) Morgan-Voyce polynomial equal to the number of k-matchings (m(G,k)) of a path graph which has N=2n+1 points. Furtermore, two relations are obtained between regularly zig-zag nonbranched catacondensed benzenid chains and Morgan-Voyce polynomials and between regularly zig-zag ...
متن کاملCombinatorics of Polynomial Iterations
A complete description of the iterated monodromy groups of postcritically finite backward polynomial iterations is given in terms of their actions on rooted trees and automata generating them. We describe an iterative algorithm for finding kneading automata associated with post-critically finite topological polynomials and discuss some open questions about iterated monodromy groups of polynomials.
متن کامل